منابع مشابه
Transitivity conditions in infinite graphs
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all k ≥ 3, the k-CS-transitive such graphs.
متن کاملA census of infinite distance-transitive graphs
This paper describes some classes of infinite distance-transitive graphs. It has no pretensions to give a complete list, but concentrates on graphs which have no finite analogues. @ 1998 Elsevier Science B.V. All rights reserved
متن کاملInfinite transitivity on universal torsors
Let X be an algebraic variety covered by open charts isomorphic to the affine space and q : X̂ → X be the universal torsor over X . We prove that the automorphism group of the quasiaffine variety X̂ acts on X̂ infinitely transitively. Also we find wide classes of varieties X admitting such a covering.
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملNeighbour transitivity on codes in Hamming graphs
We consider a code to be a subset of the vertex set of a Hamming graph. In this setting a neighbour of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the property that some group of automorphisms acts transitively on the set of neighbours of the code. We call these codes neighbour transitive. We obtain sufficient conditions for a neigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1994
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1003